Independence, Relative Randomness, and PA Degrees
نویسندگان
چکیده
We study pairs of reals that are mutually Martin-Löf random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen’s Theorem holds for non-computable probability measures, too. We study, for a given real A, the independence spectrum of A, the set of all B so that there exists a probability measure μ so that μ{A,B} = 0 and (A,B) is μ × μ-random. We prove that if A is r.e., then no ∆2 set is in the independence spectrum of A. We obtain applications of this fact to PA degrees. In particular, we show that if A is r.e. and P is of PA degree so that P 6≥T A, then A⊕ P ≥T ∅′. 1. Independence and relative randomness The property of independence is central to probability theory. Given a probability space with measure μ, we call two measurable sets A and B independent if
منابع مشابه
Propagation of partial randomness
Let f be a computable function from finite sequences of 0’s and 1’s to real numbers. We prove that strong f -randomness implies strong f randomness relative to a PA-degree. We also prove: if X is strongly f -random and Turing reducible to Y where Y is Martin-Löf random relative to Z, then X is strongly f -random relative to Z. In addition, we prove analogous propagation results for other notion...
متن کاملRandomness, relativization and Turing degrees
We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin-L?f random relative to 0_1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) > |x| ? c. The 'only if direction was obtained independently by Joseph Miller. This cha...
متن کاملDegrees of Random Sets
An explicit recursion-theoretic definition of a random sequence or random set of natural numbers was given by Martin-Löf in 1966. Other approaches leading to the notions of n-randomness and weak n-randomness have been presented by Solovay, Chaitin, and Kurtz. We investigate the properties of n-random and weakly n-random sequences with an emphasis on the structure of their Turing degrees. After ...
متن کاملRandomness and Computability
This thesis establishes significant new results in the area of algorithmic randomness. These results elucidate the deep relationship between randomness and computability. A number of results focus on randomness for finite strings. Levin introduced two functions which measure the randomness of finite strings. One function is derived from a universal monotone machine and the other function is der...
متن کاملCompactness arguments with effectively closed sets for the study of relative randomness
We present a variety of compactness arguments with Π1 classes which yield results about relative randomness, and in particular properties of the LR degrees. Recall that two sets A,B have the same LR degree if MartinLöf randomness relative to A coincides with Martin-Löf randomness relative to B. It is remarkable that in some cases, these arguments currently seem to be the only way to prove certa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 55 شماره
صفحات -
تاریخ انتشار 2014